Model Checking Merged Program Traces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Petri Nets, Traces, and Local Model Checking

It has been observed that the behavioural view of concurrent systems that all possible sequences of actions are relevant is too generous; not all sequences should be considered as likely behaviours. Taking progress fairness assumptions into account one obtains a more realistic behavioural view of the systems. In this paper we consider the problem of performing model checking relative to this be...

متن کامل

External Program Model Checking

To analyze larger models for model checking, external algorithms have shown considerable success in the verification of communication protocols. This paper applies external model checking to software executables. The state in such a verification approach itself is very large, such that main memory hinders the analysis of larger state spaces and calls for I/O efficient exploration algorithms. We...

متن کامل

Incompleteness of States w.r.t. Traces in Model Checking

Cousot and Cousot introduced and studied a general temporal specification language, called x μ -calculus, featuring a natural time-symmetric trace-based semantics. The classical state-based model checking of the x μ -calculus is an abstract interpretation of its trace-based semantics, which turns out to be incomplete (i.e., trace-incomplete), even for finite systems. This paper shows that any r...

متن کامل

Model Checking LTL Properties over C Programs with Bounded Traces

Context-bounded model checking has been used successfully to verify safety properties in multi-threaded systems automatically, even if they are implemented in low-level programming languages such as C. In this paper, we describe and experiment with an approach to extend context-bounded software model checking to safety and liveness properties expressed in linear-time temporal logic (LTL). Our a...

متن کامل

Testing Distributed Systems through Symbolic Model Checking of Traces

The observation of a distributed system’s finite execution can be abstracted as a partial ordered set of events generally called finite trace. In practice, this trace can be obtained through a standard code instrumentation, which takes advantage of existing communications between processes to partially order events of different processes. We show that testing that such a distributed execution s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2009

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2009.05.047